REDUCER: Elimination of Repetitive Codes for Accelerated Iterative Compilation

نویسندگان

چکیده

Low Level Virtual Machine (LLVM) is a widely adopted open source compiler providing numerous optimization opportunities. The discovery of the best sequence in this large space done via iterative compilation, which incurs substantial overheads, especially for big data applications operating on high volume and variety datasets. search mostly comprised identical codes generated different optimizations. However, no mechanism implemented inside LLVM to suppress redundant testings. In regard, paper proposes REDUCER eliminating code executions by performing Intermediate Representation (IR) level comparisons. has been tested using well-accepted MiCOMP technique 3.8 9.0 compiler, with embedded (cBench) workloads. comparison 19.5 k experiments, lowers experiment count up 327, i.e. 98 %, average 4 375, 77 cBench (LLVM-3.8). Similarly, LLVM-9.0 reductions are 1 931, 90 5 863, 69.9 %. Due significant reduction, workloads, compilation 58.6× 4.1× faster (LLVM-3.8) than MiCOMP, whereas, (LLVM-9.0) 8.5× 2.9× faster. Moreover, found be scalable efficient workloads where reduced few days, as compared one time only single application multiple

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative compilation for energy reduction

The rapidly increasing number of architectural changes in embedded processors puts compiler technology under an enormous stress. This is emphasized by new demands on compilers, like requirements to reduce static code size, energy consumption or power dissipation. Iterative compilation has been proposed as an approach to find the best sequence of optimizations (such as loop transformations) for ...

متن کامل

Evaluating Iterative Compilation

This paper describes a platform independent optimisation approach based on feedback-directed program restructuring. We have developed two strategies that search the optimisation space by means of profiling to find the best possible program variant. These strategies have no a priori knowledge of the target machine and can be run on any platform. In this paper our approach is evaluated on three f...

متن کامل

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

Iterative context compilation for visual object recognition

This contribution describes an almost parameterless iterative context compilation method, which produces feature layers, that are especially suited for mixed bottom-up top-down association architectures. The context model is simple and enables fast calculation. Resulting structures are invariant to position, scale and rotation of input patterns.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computing and informatics

سال: 2021

ISSN: ['1335-9150', '2585-8807']

DOI: https://doi.org/10.31577/cai_2021_3_543